Monotone clutters
نویسنده
چکیده
Ding, G., Monotone clutters, Discrete Mathematics 119 (1993) 67-77. A clutter is k-monotone, completely monotone or threshold if the corresponding Boolean function is k-monotone, completely monotone or threshold, respectively. A characterization of k-monotone clutters in terms ofexcluded minors is presented here. This result is used to derive a characterization of 2-monotone matroids and of 3-monotone matroids (which turn out to be all the threshold matroids).
منابع مشابه
Linearly dependent vectorial decomposition of clutters
This paper deals with the question of completing a monotone increasing family of subsets Γ of a finite set Ω to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate that such vectorial completions of the family of subsets Γ exist and, in addition, we show that the minimal vectorial completions of the family Γ provide a decomposition of the...
متن کاملFrom Clutters to Matroids
This paper deals with the question of completing a monotone increasing family of subsets Γ of a finite set Ω to obtain the dependent sets of a matroid. Specifically, we provide several natural processes for transforming the clutter Λ of the inclusionminimal subsets of the family Γ into the set of circuits C(M) of a matroid M with ground set Ω. In addition, by combining these processes, we prove...
متن کاملCompletion and Decomposition of a Clutter into Representable Matroids
This paper deals with the question of completing a monotone increasing family of subsets Γ of a finite set Ω to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we prove that such vectorial completions of the family of subsets Γ exist and, in addition, we show that the minimal vectorial completions of the family Γ provide a decomposition of the clutt...
متن کاملResistant sets in the unit hypercube
Ideal matrices and clutters are prevalent in Combinatorial Optimization, ranging from balanced matrices, clutters of T -joins, to clutters of rooted arborescences. Most of the known examples of ideal clutters are combinatorial in nature. In this paper, rendered by the recently developed theory of cuboids, we provide a different class of ideal clutters, one that is geometric in nature. The advan...
متن کاملDeltas, delta minors and delta free clutters
For an integer n ≥ 3, the clutter ∆n := { {1, 2}, {1, 3}, . . . , {1, n}, {2, 3, . . . , n} } is called a delta of dimension n, whose members are the lines of a degenerate projective plane. In his seminal paper on non-ideal clutters, Alfred Lehman manifested the role of the deltas as a distinct class of minimally non-ideal clutters [DIMACS, 1990]. A clutter is delta free if it has no delta mino...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 119 شماره
صفحات -
تاریخ انتشار 1993